Date: Wed, 15 Jan 1997 00:16:22 GMT
Server: NCSA/1.5.1
Last-modified: Wed, 25 Sep 1996 20:05:26 GMT
Content-type: text/html
Content-length: 17040

<head><title>Robert Cypher - Publications</title></head>

<body><h1>Robert Cypher - Publications</h1>

<HR>

<h3>Papers in Journals:</h3>

<p>

<ul>

<li><cite> Bounds on the Efficiency of Message-Passing Protocols for Parallel
Computers</cite>. 
R. Cypher, S. Konstantinidou, SIAM Journal on Computing (to appear).

<UL>
<!WA0><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm">
<!WA1><a href="http://www.cs.jhu.edu/~cypher/pubs/protocol.html">
Abstract</a>
<!WA2><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/paper.xbm">
<!WA3><a href="http://www.cs.jhu.edu/~cypher/pubs/protocol.ps">
Postscript</a>
</UL>

<p>

<li><cite> Fault-Tolerant Meshes with Small Degree</cite>. 
J. Bruck, R. Cypher, C.T. Ho, SIAM Journal on Computing (to appear).

<UL>
<!WA4><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm">
<!WA5><a href="http://www.cs.jhu.edu/~cypher/pubs/meshsub.html">
Abstract</a>
<!WA6><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/paper.xbm">
<!WA7><a href="http://www.cs.jhu.edu/~cypher/pubs/meshsub.ps">
Postscript</a>
</UL>

<p>

<li><cite> A Quantitative Study of Parallel Scientific Applications with
Explicit Communication</cite>. 
R. Cypher, S. Konstantinidou, A. Ho, P. Messina, The Journal of Supercomputing,
vol. 10, no. 1, pp. 5-24 (1996).

<UL>
<!WA8><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm">
<!WA9><a href="http://www.cs.jhu.edu/~cypher/pubs/quant.html">
Abstract</a>
<!WA10><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/paper.xbm">
<!WA11><a href="http://www.cs.jhu.edu/~cypher/pubs/quant.ps">
Postscript</a>
</UL>

<p>

<li><cite> On the Construction of Fault-Tolerant Cube-Connected Cycles 
Networks</cite>.
J. Bruck, R. Cypher, C.T. Ho, Journal of Parallel and Distributed Computing,
vol. 25, pp. 98-106 (1995).

<p>

<li><cite> CCL: A Portable and Tunable Collective Communication Library for 
Scalable Parallel Computers</cite>. 
V. Bala, J. Bruck, R. Cypher, P. Elustando, A. Ho, C.T. Ho, S. Kipnis, M. Snir, 
IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 2, 
pp. 154-164 (1995).

<UL>
<!WA12><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm">
<!WA13><a href="http://www.cs.jhu.edu/~cypher/pubs/ccl.html">
Abstract</a>
<!WA14><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/paper.xbm">
<!WA15><a href="http://www.cs.jhu.edu/~cypher/pubs/ccl.ps">
Postscript</a>
</UL>

<p>

<li><cite> Wildcard Dimensions, Coding Theory and Fault-Tolerant Meshes and 
Hypercubes</cite>. 
J. Bruck, R. Cypher, C.T. Ho, IEEE Transactions on Computers, vol. 44, no. 1, 
pp. 150-155 (1995).

<UL>
<!WA16><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm">
<!WA17><a href="http://www.cs.jhu.edu/~cypher/pubs/meshwc.html">
Abstract</a>
<!WA18><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/paper.xbm">
<!WA19><a href="http://www.cs.jhu.edu/~cypher/pubs/meshwc.ps">
Postscript</a>
</UL>

<p>

<li><cite> The IBM External User Interface for Scalable Parallel Systems</cite>.
V. Bala, J. Bruck, R. Bryant, R. Cypher, P. de Jong, P. Elustando, D. Frye,
A. Ho, C.T. Ho, G. Irwin, S. Kipnis, R. Lawrence, M. Snir,
Parallel Computing, vol. 20, pp. 445-462 (1994).

<UL>
<!WA20><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm">
<!WA21><a href="http://www.cs.jhu.edu/~cypher/pubs/eui.html">
Abstract</a>
<!WA22><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/paper.xbm">
<!WA23><a href="http://www.cs.jhu.edu/~cypher/pubs/eui.ps">
Postscript</a>
</UL>

<p>

<li><cite> Storage-Efficient, Deadlock-Free Packet Routing Algorithms for 
Torus Networks</cite>. 
R. Cypher, L. Gravano, IEEE Transactions on Computers, vol. 43, no. 12, 
pp. 1376-1385 (1994).

<UL>
<!WA24><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm">
<!WA25><a href="http://www.cs.jhu.edu/~cypher/pubs/torus.html">
Abstract</a>
<!WA26><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/paper.xbm">
<!WA27><a href="http://www.cs.jhu.edu/~cypher/pubs/torus.ps">
Postscript</a>
</UL>

<p>

<li><cite> Requirements for Deadlock-Free, Adaptive Packet Routing</cite>. 
R. Cypher, L. Gravano, SIAM Journal on Computing, vol. 23, no. 6, 
pp. 1266-1274 (1994).

<UL>
<!WA28><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm">
<!WA29><a href="http://www.cs.jhu.edu/~cypher/pubs/require.html">
Abstract</a>
<!WA30><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/paper.xbm">
<!WA31><a href="http://www.cs.jhu.edu/~cypher/pubs/require.ps">
Postscript</a>
</UL>

<p>

<li><cite> Embedding Cube-Connected Cycles Graphs into Faulty Hypercubes</cite>.
J. Bruck, R. Cypher, D. Soroker, IEEE Transactions on Computers, vol. 43, 
no. 10, pp. 1210-1220 (1994).

<p>

<li><cite> Tolerating Faults in a Mesh with a Row of Spare Nodes</cite>.
J. Bruck, R. Cypher, C.T. Ho, Theoretical Computer Science, vol. 128, 
pp. 241-252 (1994).

<p>

<li><cite> Fault-Tolerant de Bruijn and Shuffle-Exchange Networks</cite>. 
J. Bruck, R. Cypher, C.T. Ho, IEEE Transactions on Parallel and Distributed 
Systems, vol. 5, no. 5, pp. 548-553 (1994).

<p>

<li><cite> Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and
Related Computers</cite>. 
R. Cypher, G. Plaxton, Journal of Computer and System Sciences, Special Issue 
for STOC 1990, vol. 47, pp. 501-548 (1993).

<UL>
<!WA32><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm">
<!WA33><a href="http://www.cs.jhu.edu/~cypher/pubs/sharesort.html">
Abstract</a>
<!WA34><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/paper.xbm">
<!WA35><a href="http://www.cs.jhu.edu/~cypher/pubs/sharesort.ps">
Postscript</a>
</UL>

<p>

<li><cite> Theoretical Aspects of VLSI Pin Limitations</cite>.
R. Cypher, SIAM Journal on Computing, vol. 22, no. 2, pp. 356-378 (1993).

<p>

<li><cite> A Lower Bound on the Size of Shellsort Sorting Networks</cite>.
R. Cypher, SIAM Journal on Computing, vol. 22, no. 1, pp. 62-71 (1993).

<p>

<li><cite> Fault-Tolerant Meshes and Hypercubes with Minimal Numbers of 
Spares</cite>.
J. Bruck, R. Cypher, C.T. Ho, IEEE Transactions on Computers, vol. 42,
no. 9, pp. 1089-1104 (1993).

<p>

<li><cite> Area-Efficient Architectures for the Viterbi Algorithm - Part II: 
Applications</cite>.
B. Shung, H. Lin, R. Cypher, P. Siegel, H. Thapar, IEEE Transactions on 
Communications, vol. 41, no. 5, pp. 802-807 (1993).

<p>

<li><cite> Area-Efficient Architectures for the Viterbi Algorithm - Part I: 
Theory</cite>. 
B. Shung, H. Lin, R. Cypher, P. Siegel, H. Thapar, IEEE Transactions on 
Communications, vol. 41, no. 4, pp. 636-644 (1993).

<p>

<li><cite> Generalized Trace-Back Techniques for Survivor Memory Management in 
the Viterbi Algorithm</cite>. 
R. Cypher, B. Shung, Journal of VLSI Signal Processing, vol. 5, no. 1, 
pp. 85-94 (1993).

<p>

<li><cite> Tolerating Faults in Hypercubes Using Subcube Partitioning</cite>.
J. Bruck, R. Cypher, D. Soroker, IEEE Transactions on Computers, Special Issue 
on Fault-Tolerant Computing, vol. 41, no. 5, pp. 599-605 (1992).

<UL>
<!WA36><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm">
<!WA37><a href="http://www.cs.jhu.edu/~cypher/pubs/hcnodes.html">
Abstract</a>
<!WA38><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/paper.xbm">
<!WA39><a href="http://www.cs.jhu.edu/~cypher/pubs/hcnodes.ps">
Postscript</a>
</UL>

<p>

<li><cite> Cubesort: A Parallel Algorithm for Sorting N Data Items with 
S-Sorters</cite>.
R. Cypher, J. Sanz, Journal of Algorithms, vol. 13, pp. 211-234 (1992).

<p>

<li><cite> Data Reduction and Fast Routing: A Strategy for Efficient Algorithms 
for Message-Passing Parallel Computers</cite>. 
J. Sanz, R. Cypher, Algorithmica, vol. 7, pp. 77-89 (1992).

<p>

<li><cite> The Hough Transform Has O(N) Complexity on N x N Mesh Connected 
Computers</cite>. 
R. Cypher, J. Sanz, L. Snyder, SIAM Journal on Computing, vol. 19, no. 5, 
pp. 805-820 (1990).

<p>

<li><cite> Algorithms for Image Component Labeling on SIMD Mesh Connected 
Computers</cite>. 
R. Cypher, J. Sanz, L. Snyder, IEEE Transactions on Computers, vol. 39,
no. 2, pp. 276-281 (1990).

<p>

<li><cite> SIMD Architectures and Algorithms for Image Processing and Computer 
Vision</cite>. 
R. Cypher, J. Sanz, IEEE Transactions on Acoustics, Speech, and Signal 
Processing, vol. 37, no. 12, pp. 2158-2174 (1989).

<p>

<li><cite> Hypercube and Shuffle-Exchange Algorithms for 
Image Component Labeling</cite>. 
R. Cypher, J. Sanz, L. Snyder, Journal of Algorithms, vol. 10, pp. 140-150 
(1989).

<p>

<li><cite> An EREW PRAM Algorithm for Image Component Labeling</cite>. 
R. Cypher, J. Sanz, L. Snyder, IEEE Transactions on Pattern Analysis and 
Machine Intelligence, vol. 11, no. 3, pp. 258-261 (1989).

<p>

<li><cite> Apex: Two Architectures for Generating Parametric Curves and 
Surfaces</cite>. 
T. DeRose, M. Bailey, B. Barnard, R. Cypher, D. Dobrikin, C. Ebeling, 
S. Konstantinidou, L. McMurchie, H. Mizrahi, B. Yost, 
The Visual Computer, vol. 5, no. 5, pp. 264-276 (1989).

</ul>

<p>

<HR>

<h3>Papers in Refereed Conferences:</h3>

<p>

<ul>

<li><cite> The Communication Requirements of Mutual Exclusion</cite>.
R. Cypher, Proceedings 1995 ACM Symposium on Parallel Algorithms and 
Architectures, pp. 147-156.

<UL>
<!WA40><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm">
<!WA41><a href="http://www.cs.jhu.edu/~cypher/pubs/mutex.html">
Abstract</a>
<!WA42><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/paper.xbm">
<!WA43><a href="http://www.cs.jhu.edu/~cypher/pubs/mutex.ps">
Postscript</a>
</UL>

<p>

<li><cite> Minimal, Deadlock-Free Routing in Hypercubic and Arbitrary 
Networks</cite>.
R. Cypher, Proceedings 1995 IEEE Symposium on Parallel and Distributed
Processing, pp. 122-129.

<UL>
<!WA44><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm">
<!WA45><a href="http://www.cs.jhu.edu/~cypher/pubs/db.html">
Abstract</a>
<!WA46><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/paper.xbm">
<!WA47><a href="http://www.cs.jhu.edu/~cypher/pubs/db.ps">
Postscript</a>
</UL>

<p>

<li><cite> Efficient Race Detection for Message-Passing Programs with Nonblocking
Sends and Receives</cite>. 
R. Cypher, E. Leu, Proceedings 1995 IEEE Symposium on Parallel and Distributed
Processing, pp. 534-541.

<UL>
<!WA48><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm">
<!WA49><a href="http://www.cs.jhu.edu/~cypher/pubs/race.html">
Abstract</a>
<!WA50><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/paper.xbm">
<!WA51><a href="http://www.cs.jhu.edu/~cypher/pubs/race.ps">
Postscript</a>
</UL>

<p>

<li><cite> Repeatable and Portable Message-Passing Programs</cite>. 
R. Cypher, E. Leu, Proceedings 1994 ACM Symposium on Principles of Distributed 
Computing, pp. 22-31.

<UL>
<!WA52><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm">
<!WA53><a href="http://www.cs.jhu.edu/~cypher/pubs/repeat.html">
Abstract</a>
<!WA54><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/paper.xbm">
<!WA55><a href="http://www.cs.jhu.edu/~cypher/pubs/repeat.ps">
Postscript</a>
</UL>

<p>

<li><cite> CCL: A Portable and Tunable Collective Communication Library for 
Scalable Parallel Computers</cite>. 
J. Bruck, R. Cypher, P. Elustando, A. Ho, C.T. Ho, V. Bala, S. Kipnis, M. Snir, 
Proceedings 1994 International Parallel Processing Symposium, pp. 835-844.

<p>

<li><cite> The Semantics of Blocking and Nonblocking Send and Receive 
Primitives</cite>.
R. Cypher, E. Leu, Proceedings 1994 International Parallel Processing Symposium,
pp. 729-735.

<UL>
<!WA56><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/abstract.xbm">
<!WA57><a href="http://www.cs.jhu.edu/~cypher/pubs/semantics.html">
Abstract</a>
<!WA58><IMG SRC="http://www.cs.jhu.edu/~cypher/pubs/paper.xbm">
<!WA59><a href="http://www.cs.jhu.edu/~cypher/pubs/semantics.ps">
Postscript</a>
</UL>

<p>

<li><cite> Bounds on the Efficiency of Message-Passing Protocols for Parallel
Computers</cite>. 
R. Cypher, S. Konstantinidou, Proceedings 1993 ACM Symposium on Parallel 
Algorithms and Architectures, pp. 173-181.

<p>

<li><cite> Fault-Tolerant Meshes with Small Degree</cite>. 
J. Bruck, R. Cypher, C.T. Ho, Proceedings 1993 ACM Symposium on Parallel 
Algorithms and Architectures, pp. 1-10.

<p>

<li><cite> Architectural Requirements of Parallel Scientific Applications with
Explicit Communication</cite>. 
R. Cypher, S. Konstantinidou, A. Ho, P. Messina, Proceedings 1993 International 
Symposium on Computer Architecture, pp. 2-13.

<p>

<li><cite> Wildcard Dimensions, Coding Theory and Fault-Tolerant Meshes and 
Hypercubes</cite>. 
J. Bruck, R. Cypher, C.T. Ho, Proceedings 1993 International Symposium on 
Fault-Tolerant Computing, pp. 260-267.

<p>

<li><cite> Tolerating Faults in a Mesh with a Row of Spare Nodes</cite>. 
J. Bruck, R. Cypher, C.T. Ho, Proceedings 1992 IEEE Symposium on Parallel and 
Distributed Processing, pp. 12-19.

<p>

<li><cite> Fault-Tolerant Embeddings of Rings, Meshes and Tori in 
Hypercubes</cite>.
A. Wang, R. Cypher, Proceedings 1992 IEEE Symposium on Parallel and Distributed
Processing, pp. 20-29.

<p>

<li><cite> Multiple Message Broadcasting with Generalized Fibonacci 
Trees</cite>. 
J. Bruck, R. Cypher, C.T. Ho, Proceedings 1992 IEEE Symposium on Parallel and 
Distributed Processing, pp. 424-431.

<p>

<li><cite> Hierarchical Shuffle-Exchange and de Bruijn Networks</cite>. 
R. Cypher, J. Sanz, Proceedings 1992 IEEE Symposium on Parallel and Distributed
Processing, pp. 491-496.

<p>

<li><cite> Fault Tolerant Graphs, Perfect Hash Functions and Disjoint 
Paths</cite>.
M. Ajtai, N. Alon, J. Bruck, R. Cypher, C.T. Ho, M. Naor, E. Szemeredi,
Proceedings 33rd IEEE Symposium on Foundations of Computer Science, 
1992, pp. 693-702.

<p>

<li><cite> Adaptive, Deadlock-Free Packet Routing in Torus Networks with Minimal
Storage</cite>. 
R. Cypher, L. Gravano, Proceedings 1992 International Conference on Parallel 
Processing, vol. III, pp. 204-211.

<p>

<li><cite> Fault-Tolerant de Bruijn and Shuffle-Exchange Networks</cite>. 
J. Bruck, R. Cypher, C.T. Ho, Proceedings 1992 International Conference on 
Parallel Processing, vol. III, pp. 46-50.

<p>

<li><cite> Requirements for Deadlock-Free, Adaptive Packet Routing</cite>. 
R. Cypher, L. Gravano, Proceedings 1992 ACM Symposium on Principles of 
Distributed Computing, pp. 25-33.

<p>

<li><cite> Efficient Fault-Tolerant Mesh and Hypercube Architectures</cite>. 
J. Bruck, R. Cypher, C.T. Ho, Proceedings 1992 International Symposium on 
Fault-Tolerant Computing, pp. 162-169.

<p>

<li><cite> Embedding Complete Binary Trees in Faulty Hypercubes</cite>.
A. Wang, R. Cypher, E. Mayr, Proceedings 1991 IEEE Symposium on Parallel and
Distributed Processing, pp. 112-119.

<p>

<li><cite> Fault-Tolerant Meshes with Minimal Numbers of Spares</cite>.
J. Bruck, R. Cypher, C.T. Ho, Proceedings 1991 IEEE Symposium on Parallel and
Distributed Processing, pp. 288-295.

<p>

<li><cite> A Comparison of SIMD Hypercube Routing Strategies</cite>. 
M. Fulgham, R. Cypher, J. Sanz, Proceedings 1991 International Conference on 
Parallel Processing, vol. III, pp. 236-243.

<p>

<li><cite> On the Construction of Fault-Tolerant Cube-Connected Cycles 
Networks</cite>.
J. Bruck, R. Cypher, C.T. Ho, Proceedings 1991 International Conference on 
Parallel Processing, vol. I, pp. 692-693.

<p>

<li><cite> Generalized Trace-Back Techniques for Survivor Memory Management in 
the Viterbi Algorithm</cite>. 
R. Cypher, B. Shung, Proceedings 1990 IEEE Global Telecommunications Conference,
pp. 1318-1322.

<p>

<li><cite> Theoretical Aspects of VLSI Pin Limitations</cite>.
R. Cypher, Proceedings 6th MIT Conference on Advanced Research in VLSI, 
pp. 314-327 (1990).

<p>

<li><cite> Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and
Related Computers</cite>. 
R. Cypher, G. Plaxton, Proceedings 22nd ACM Symposium on Theory of Computing, 
pp. 193-203 (1990).

<p>

<li><cite> Running Algorithms Efficiently on Faulty Hypercubes</cite>. 
J. Bruck, R. Cypher, D. Soroker, Proceedings 1990 ACM Symposium on Parallel 
Algorithms and Architectures, pp. 37-44.

<p>

<li><cite> A Lower Bound on the Size of Shellsort Sorting Networks</cite>.
R. Cypher, Proceedings 1989 ACM Symposium on Parallel Algorithms and 
Architectures, pp. 58-63.

<p>

<li><cite> Algorithms for Massively Parallel Image Processing 
Architectures</cite>. 
R. Cypher, J. Sanz, Proceedings 9th International Conference on Pattern 
Recognition, pp. 412-419 (1988).

<p>

<li><cite> Cubesort: An Optimal Sorting Algorithm for 
Feasible Parallel Computers</cite>. 
R. Cypher, J. Sanz, Proceedings 1988 Aegean Workshop on Computing, pp. 456-464.

<p>

<li><cite> Optimal Sorting on Reduced Architectures</cite>. 
R. Cypher, J. Sanz, Proceedings 1988 International Conference on Parallel 
Processing, vol. III, pp. 308-311.

<p>

<li><cite> Practical Algorithms for Image Component Labeling on SIMD Mesh 
Connected Computers</cite>. 
R. Cypher, J. Sanz, L. Snyder, Proceedings 1987 International Conference on 
Parallel Processing, pp. 772-779.

<p>

<li><cite> The Hough Transform Has O(N) Complexity on SIMD N x N Mesh Array 
Architectures</cite>. 
R. Cypher, J. Sanz, L. Snyder, Proceedings 1987 Workshop on Computer 
Architecture for Pattern Analysis and Machine Intelligence, pp. 115-121.

<p>

<li><cite> Hypercube and Shuffle-Exchange Algorithms for Image Component 
Labeling</cite>. 
R. Cypher, J. Sanz, L. Snyder, Proceedings 1987 Workshop on Computer 
Architecture for Pattern Analysis and Machine Intelligence, pp. 5-10.

<p>

<li><cite> EREW PRAM and Mesh Connected Computer Algorithms for Image Component 
Labeling</cite>. 
R. Cypher, J. Sanz, L. Snyder, Proceedings 1987 Workshop on Computer 
Architecture for Pattern Analysis and Machine Intelligence, pp. 122-130.

</ul>

<p>

<HR>

<h3>Book:</h3>

<p>

<ul>

<li><cite> The SIMD Model of Parallel Computation</cite>. 
R. Cypher, J. Sanz, Springer-Verlag, New York, NY, 1994.

</ul>

<p>

<HR>

<h3>Other Publications:</h3>

<p>

<ul>

<li><cite> Survey of Routing Issues for the Vulcan Parallel Computer</cite>.
J. Bruck, R. Cypher, L. Gravano, A. Ho, C.T. Ho, S. Konstantinidou, E. Upfal,
IBM Almaden, Technical Report, June 1992.

<p>

<li><cite> A Proposal for the Topology and Wiring of the Green Vulcan</cite>.
J. Bruck, Cypher, C.T. Ho, E. Upfal, IBM Almaden, Technical Report, 
February 1991.

<p>

<li><cite> Techniques for Shared Key Sorting</cite>. 
R. Cypher, G. Plaxton, IBM Almaden, Technical Report, March 1990.

<p>

<li><cite> Efficient Communication in Massively Parallel Computers</cite>.
R. Cypher, Ph.D. Dissertation, Dept. of Computer Science, U. of Washington, 
June 1989.

<p>

<li><cite> Valiant's Maximum Algorithm with Sequential Memory Accesses</cite>.
R. Cypher, Dept. of Computer Science, U. of Washington, Technical Report,
April 1988.

</ul>

<p>

<HR>

<h3>Patents:</h3>

<p>

<ul>

<li><cite> Methods and Apparatus for Tolerating Faults in Mesh 
Architectures</cite>.
J. Bruck, R. Cypher, C.T. Ho, US Patent No. 5,280,607, Jan. 1994.

<p>

<li><cite> Method and Apparatus for a Fault-Tolerant Mesh with Spare 
Nodes</cite>.
J. Bruck, R. Cypher, C.T. Ho, US Patent No. 5,271,014, Dec. 1993.

<p>

<li><cite> A Method of Packet Routing in Torus Networks with Two Buffers per 
Edge</cite>.
R. Cypher, L. Gravano, US Patent No. 5,444,701, Aug. 1995.

<p>

<li><cite> A Method for Generating Hierarchical Fault-Tolerant Mesh 
Architectures</cite>.
J. Bruck, R. Cypher, C.T. Ho, US Patent No. 5,513,313, Apr. 1996.

<p>

<li><cite> New Hierarchical Interconnection Networks for Parallel 
Processing</cite>.
R. Cypher, J. Sanz, US Patent No. 5,513,371, Apr. 1996.

</ul>

<p>

<HR>

<!WA60><a href="http://www.cs.jhu.edu/~cypher/home.html"> Return to Home Page</a>

<HR>

Last updated September 25, 1996.
